Partial Ranking by Incomplete Pairwise Comparisons Using Preference Subsets
نویسنده
چکیده
In multi-criteria decision making the decision maker need to assign weights to criteria for evaluation of alternatives, but decision makers usually find it difficult to assign precise weights to several criteria. On the other hand, decision makers may readily provide a number of preferences regarding the relative importance between two disjoint subsets of criteria. We extend a procedure by L. V. Utkin for ranking alternatives based on decision makers’ preferences. With this new method we may evaluate and rank partial sequences of preferences between two subsets of criteria. To achieve this ranking it is necessary to model the information value of an incomplete sequence of preferences and compare this with the belief-plausibility of that sequence in order to find the partial ranking of preferences with maximum utility.
منابع مشابه
A new ranking procedure by incomplete pairwise comparisons using preference subsets
A method for ranking of alternatives or objects and its extensions by incomplete pairwise comparisons using Dempster-Shafer theory are proposed in the paper. The main feature of the method is that it allows us to deal with comparisons of arbitrary subsets of alternatives. The method is extended on the case of independent groups of experts. The imprecise Dirichlet model is also used to make caut...
متن کاملA Ranking Procedure by Incomplete Pairwise Comparisons Using Information Entropy and Dempster-Shafer Evidence Theory
Decision-making, as a way to discover the preference of ranking, has been used in various fields. However, owing to the uncertainty in group decision-making, how to rank alternatives by incomplete pairwise comparisons has become an open issue. In this paper, an improved method is proposed for ranking of alternatives by incomplete pairwise comparisons using Dempster-Shafer evidence theory and in...
متن کاملRanking from Pairwise Comparisons: The Role of the Pairwise Preference Matrix
Ranking a set of items given preferences among them is a fundamental problem that arises naturally in several real world situations such as ranking candidates in elections, movies, sports teams, documents in response to a query to name a few. In each of these situations, the preference data among the items to be ranked may be available in different forms: as pairwise comparisons, partial orderi...
متن کاملThe separation, and separation-deviation methodology for group decision making and aggregate Ranking
In a generic group decision scenario, the decision makers review alternatives and then provide their own individual ranking. The aggregate ranking problem is to obtain a ranking that is fair and representative of the individual rankings. We argue here that using cardinal pairwise comparisons provides several advantages over score-wise models. The aggregate group ranking problem is then formaliz...
متن کاملThe Asymptotics of Ranking Algorithms
We consider the predictive problem of supervised ranking, where the task is to rank sets of candidate items returned in response to queries. Although there exist statistical procedures that come with guarantees of consistency in this setting, these procedures require that individuals provide a complete ranking of all items, which is rarely feasible in practice. Instead, individuals routinely pr...
متن کامل